Law-Abiding Causal Decision Theory

Deriving Law-Abiding Instances

Liquid Haskell augments the Haskell language with theorem proving capabilities, allowing programmers to express and prove class laws. But many of these proofs require routine, boilerplate code and do not scale well, as the size of proof terms can grow superlinearlywith the size of the datatypes involved in the proofs. We present a technique to derive Haskell proof terms by leveraging datatype-g...

Comments on Causal Decision Theory

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

Conditionals in causal decision theory

This paper explores the possibility that causal decision theory can be formulated in terms of probabilities of conditionals. It is argued that a generalized Stalnaker semantics in combination with an underlying branching time structure not only provides the basis for a plausible account of the semantics of indicative conditionals, but also that the resulting conditionals have properties that ma...

Causal Decision Theory and EPR correlations

Regret and instability in causal decision theory

Andy Egan has recently produced a set of alleged counterexamples to causal decision theory (CDT) in which agents are forced to decide among causally unratifiable options, thereby making choices they know they will regret. I show that, far from being counterexamples, CDT gets Egan’s cases exactly right. Egan thinks otherwise because he has misapplied CDT to his cases by requiring agents to make ...